On the average size of sets in intersecting Sperner families
نویسندگان
چکیده
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than ( n−1 k−1 ) is at least k provided that k 6 n=2− √ n=2 + 1. The statement is not true if n=2¿ k ¿n=2−√8n+ 1=8+9=8. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets
For a set G and a family of sets F let DF (G) = {F ∈ F : F ∩ G = ∅} and SF (G) = {F ∈ F : F ⊆ G or G ⊆ F}. We say that a family is l-almost intersecting, (≤ l)-almost intersecting, l-almost Sperner, (≤ l)-almost Sperner if |DF (F )| = l, |DF (F )| ≤ l, |SF (F )| = l, |SF (F )| ≤ l (respectively) for all F ∈ F . We consider the problem of finding the largest possible family for each of the above...
متن کاملAnother Simple Proof of a Theorem of Milner
In this note we give a short proof of a theorem of Milner concerning intersecting Sperner systems. An intersecting Sperner system on [n] = {1, . . . , n} is a collection of subsets of [n], no pair of which is either disjoint or nested. Milner [2] proved that an intersecting Sperner system on [n] has at most ( n d(n+1)/2e ) sets. Katona [1] gave a simple proof of Milner’s theorem using the cycle...
متن کاملEKR type inequalities for 4-wise intersecting families
Let 1 ≤ t ≤ 7 be an integer and let F be a k-uniform hypergraph on n vertices. Suppose that |A∩B∩C∩D| ≥ t holds for all A,B,C,D ∈ F . Then we have |F | ≤ (n−t k−t ) if | k n − 2 |< ε holds for some ε > 0 and all n > n0(ε). We apply this result to get EKR type inequalities for “intersecting and union families” and “intersecting Sperner families.”
متن کاملOn the structure of maximum 2-part Sperner families
Color the elements of a finite set S with two colors. A collection of subsets of S is called a 2-part Sperner family if whenever for two distinct sets A and B in this collection we have A ⊂ B then B − A has elements of S of both colors. All 2-part Sperner families of maximum size were characterized in Erdös and Katona [5]. In this paper we provide a different, and quite elementary proof of the ...
متن کاملTwo-Part Set Systems
The two part Sperner theorem of Katona and Kleitman states that if X is an n-element set with partition X1 ∪X2, and F is a family of subsets of X such that no two sets A,B ∈ F satisfy A ⊂ B (or B ⊂ A) and A ∩ Xi = B ∩ Xi for some i, then |F| ≤ ( n ⌊n/2⌋ ) . We consider variations of this problem by replacing the Sperner property with the intersection property and considering families that satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 257 شماره
صفحات -
تاریخ انتشار 2002